Minimum-Energy Multiwavelet Frame on the Interval[0,1]
نویسندگان
چکیده
منابع مشابه
Multiwavelet Packets and Frame Packets of L
The orthonormal basis generated by a wavelet of L(R) has poor frequency localization. To overcome this disadvantage Coifman, Meyer, and Wickerhauser constructed wavelet packets. We extend this concept to the higher dimensions where we consider arbitrary dilation matrices. The resulting basis of L(R) is called the multiwavelet packet basis. The concept of wavelet frame packet is also generalized...
متن کاملMinimum-Energy Bivariate Wavelet Frame with Arbitrary Dilation Matrix
In order to characterize the bivariate signals, minimum-energy bivariate wavelet frames with arbitrary dilation matrix are studied, which are based on superiority of theminimum-energy frame and the significant properties of bivariate wavelet. Firstly, the concept ofminimum-energy bivariate wavelet frame is defined, and its equivalent characterizations and a necessary condition are presented. Se...
متن کاملMULTIWAVELET PACKETS AND FRAME PACKETS OF L 2 (R d)
The orthonormal basis generated by a wavelet of L 2 (R) has poor frequency localization. To overcome this disadvantage Coifman, Meyer, and Wickerhauser constructed wavelet packets. We extend this concept to the higher dimensions where we consider arbitrary dilation matrices. The resulting basis of L 2 (R d) is called the multiwavelet packet basis. The concept of wavelet frame packet is also gen...
متن کاملThe Effect of Local Damage on Energy Absorption of Steel Frame Buildings During Earthquake
Progressive collapse is a kind of failure in which whole or large part of a structure collapse when a local damage occurs and distributes to other parts. Many researchers focus on the column removal analysis and study of the structure behavior under effect of gravity loads, so these investigations are mostly carried out on the tall building. Earthquake inspections indicate structural element ca...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/262637